Two Frameworks for Discrete Mathematics
نویسندگان
چکیده
Information Systems and Computer Science educators have campaigned to increase mathematical content in the computing curriculum. Unfortunately, mathematical concepts are often presented in a manner that conflicts with the general mental framework, or gestalt, of IS and CS students. However, there is more than one gestalt in mathematics. In previous research, we developed two scales for measuring mathematical gestalt in books--a Logical Math scale and a Computational Math scale. In this paper, we apply our two scales to current Discrete Math textbooks to assess the relative emphasis these books give to each gestalt. Our findings have relevance in the development of approaches for teaching mathematical topics in computer courses, especially Discrete Math courses.
منابع مشابه
The rigidity of periodic frameworks as graphs on a fixed torus
We define periodic frameworks as graphs on the torus, using the language of gain graphs. We present some fundamental definitions and results about the infinitesimal rigidity of graphs on a torus of fixed size and shape, and find necessary conditions for the generic rigidity of periodic frameworks on a d-dimensional fixed torus.
متن کاملOn the universal rigidity of generic bar frameworks
In this paper, we present a sufficient condition for the universal rigidity of a generic bar framework G(p) in terms of the Gale matrix Z corresponding to G(p). We also establish a relationship between the stress matrix S and the Gale matrix Z for bar frameworks. This allows us to translate back and forth between S and Z in recently obtained results concerning universal rigidity, global rigidit...
متن کاملOn general frameworks and threshold functions for multiple domination
We consider two general frameworks for multiple domination, which are called 〈r, s〉-domination and parametric domination. They generalise and unify {k}-domination, k-domination, total k-domination and k-tuple domination. In this paper, known upper bounds for the classical domination are generalised for the 〈r, s〉-domination and parametric domination numbers. These generalisations are based on t...
متن کاملNumerical algorithm for discrete barrier option pricing in a Black-Scholes model with stationary process
In this article, we propose a numerical algorithm for computing price of discrete single and double barrier option under the emph{Black-Scholes} model. In virtue of some general transformations, the partial differential equations of option pricing in different monitoring dates are converted into simple diffusion equations. The present method is fast compared to alterna...
متن کاملSELECTIVE GROUPOIDS AND FRAMEWORKS INDUCED BY FUZZY SUBSETS
In this paper, we show that every selective groupoid induced by a fuzzy subset is a pogroupoid, and we discuss several properties in quasi ordered sets by introducing the notion of a framework.
متن کامل